Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
21	Numbers, constants and computation 1 Numerical evaluation of the Riemann Zeta-function Add to Reading List Source URL: wiskunde.vandelden.net Language: English - Date: 2010-04-15 08:54:48 Mathematics Mathematical analysis Number theory Analytic number theory Bernhard Riemann Conjectures Riemann zeta function Arithmetic functions Riemann hypothesis Z function RiemannSiegel formula Bernoulli number
22	To appear in Neural Computation Methods for Binary Multidimensional Scaling Douglas L. T. Rohde School of Computer Science, Carnegie Mellon University, and the Center for the Neural Basis of Cognition Add to Reading List Source URL: tedlab.mit.edu Language: English - Date: 2012-08-07 12:32:37 Algebra Mathematics Linear algebra Vectors Multivariate statistics Matrix theory Abstract algebra Multidimensional scaling Singular value decomposition Euclidean vector Principal component analysis Latent semantic analysis
23	MATHEMATICS OF COMPUTATION SArticle electronically published on February 15, 2002 CLASS NUMBERS OF REAL CYCLOTOMIC FIELDS OF PRIME CONDUCTOR Add to Reading List Source URL: www.mat.uniroma2.it Language: English - Date: 2002-11-22 18:43:22 Algebra Abstract algebra Mathematics Commutative algebra Algebraic structures Ring theory Homological algebra Algebraic number theory Algebraic number field Divisor Gorenstein ring Ring
24	Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is Add to Reading List Source URL: www.cse.iitk.ac.in Language: English - Date: 2016-07-30 09:35:21 Computational complexity theory Theory of computation Complexity classes Graph isomorphism problem NP PP Low Graph automorphism Hidden subgroup problem Time complexity P Chromatic polynomial
25	Steve Warner Curriculum Vitae Department of Mathematics Hofstra University Hempstead, NY 11549 Add to Reading List Source URL: satprepget800.com Language: English - Date: 2016-06-13 13:02:27 Mathematical logic Logic Computability theory Theory of computation Proof theory Hierarchy Lambda calculus Theoretical computer science Consistency Propositional calculus Calculus Arithmetical hierarchy
26	Theory of Evolutionary Algorithms Benjamin Doerr1 and Carola Doerr2 1École Polytechnique, Paris-Saclay, France 2CNRS and Université Pierre et Marie Curie, Paris, France Add to Reading List Source URL: www.wcci2016.org Language: English - Date: 2016-06-10 00:18:56 Operations research Evolution Applied mathematics Mathematical optimization Cybernetics Academia Mathematics Evolutionary algorithm Doerr Genetic and Evolutionary Computation Conference Algorithm Evolutionary computation
27	Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2006-09-25 10:55:42 Cryptography Mathematical analysis Quantum complexity theory Computational complexity theory Functions and mappings Secure multi-party computation Communication complexity Secure two-party computation Limit of a function Cryptographic protocol Pi PP
28	On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing Add to Reading List Source URL: korrekt.org Language: English - Date: 2016-06-13 07:14:39 Computational complexity theory Finite automata Complexity classes Theory of computation Nondeterministic finite automaton Regular language PSPACE Bchi automaton FO Permutation IP Structure
29	Powerpoint-presentation Information and Computing Sciences Add to Reading List Source URL: usefulpatterns.org Language: English - Date: 2015-04-25 08:23:03 Theoretical computer science Theory of computation Algorithmic information theory Computability theory Academia Randomness Turing machine Kolmogorov complexity Algorithmically random sequence Algorithmic probability Minimum description length Complexity
30	CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-01-06 16:13:01 Computational complexity theory Theory of computation Complexity classes NP Clique problem Linear programming P Algorithm Time complexity Optimization problem Book:Graph Theory P versus NP problem